An Analysis of Robustness Approaches for the Airport Baggage Sorting Station Assignment Problem
نویسندگان
چکیده
منابع مشابه
An analysis of constructive algorithms for the airport baggage sorting station assignment problem
The appropriate assignment of airport resources can greatly affect the quality of service which airlines and airports provide to their customers. Good assignments can help airlines and airports keep to published schedules by minimising changes or delays while waiting for resources to become available. In this paper, we consider a resource allocation problem, namely the problem of assigning avai...
متن کاملAn Evolutionary Algorithm for the Over-constrained Airport Baggage Sorting Station Assignment Problem
(The final publication is available at link.springer.com) Abstract. Airport baggage sorting stations are the places at which the baggage for each flight accumulates for loading into containers or directly onto the aircraft. In this paper the multi-objective and multi-constraint problem of assigning Baggage Sorting Stations in an Airport is defined and an Evolutionary Algorithm is presented, whi...
متن کاملThe over-constrained airport gate assignment problem
In this paper, we study the over-constrained airport gate assignment problem where the objectives are to minimize the number of ungated 4ights and total walking distances or connection times. We 7rst use a greedy algorithm to minimize ungated 4ights. Exchange moves are employed to facilitate the use of heuristics. Simulated annealing and a hybrid of simulated annealing and tabu search are used....
متن کاملThe Airport Gate Assignment Problem: A Survey
The airport gate assignment problem (AGAP) is one of the most important problems operations managers face daily. Many researches have been done to solve this problem and tackle its complexity. The objective of the task is assigning each flight (aircraft) to an available gate while maximizing both conveniences to passengers and the operational efficiency of airport. This objective requires a sol...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization
سال: 2016
ISSN: 2356-752X,2314-6486
DOI: 10.1155/2016/1213949